Switcher-random-walks: a cognitive-inspired mechanism for network exploration
نویسندگان
چکیده
JOAQUÍN GOÑI∗,†, IÑIGO MARTINCORENA†, BERNAT COROMINAS-MURTRA‡, GONZALO ARRONDO†, SERGIO ARDANZA-TREVIJANO∗ and PABLO VILLOSLADA†,§ ∗Department of Physics and Applied Mathematics, University of Navarra, Pamplona, Spain †Department of Neurosciences, Center for Applied Medical Research, University of Navarra, Pamplona, Spain ‡ICREA-Complex Systems Lab, Universitat Pompeu Fabra – Parc de Recerca Biomèdica de Barcelona, Dr. Aiguader 80, 08003 Barcelona, Spain §Department of Neurosciences, Institut d’investigacions Biomèdiques August Pi i Sunyer (IDIBAPS) Hospital Cĺınic, Barcelona, Spain §[email protected]
منابع مشابه
Network Discovery by Generalized Random Walks
We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling∼ n as f...
متن کاملLévy random walks on multiplex networks
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Lév...
متن کاملReducing Search Lengths with Locally Precomputed Partial Random Walks
Random walks can be used to search complex networks for a desired resource. To reduce the number of hops necessary to find resources, we propose a search mechanism based on building random walks connecting together partial walks that have been precomputed at each network node in an initial stage. The resources found in each partial walk are registered in its associated Bloom filter. Searches ca...
متن کاملBiased random walks on multiplex networks
Biased random walks on complex networks are a particular type of walks whose motion is biased on properties of the destination node, such as its degree. In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by sampling homogeneously the nodes. In multiplex networks, the nodes are related throug...
متن کاملCoverage characteristics of self-repelling random walks in mobile ad-hoc networks
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed for two dimensional lattices and these walks have been shown to exhibit a remarkable uniformity with which they visit nodes in a graph. In this paper, we exte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 20 شماره
صفحات -
تاریخ انتشار 2010